Trees with Smaller Harmonic Indices
نویسندگان
چکیده
The harmonic index H (G) of a graph G is defined as the sum of the weights 2 du+dv of all edges uv of G, where du denotes the degree of a vertex u in G. In this paper, we determine (i) the trees of order n and m pendant vertices with the second smallest harmonic index, (ii) the trees of order n and diameter r with the smallest and the second smallest harmonic indices, and (iii) the trees of order n with the second, the third and the fourth smallest harmonic index, respectively.
منابع مشابه
شاخص‌های فیزیولوژیکی کمبود آهن در درختان چنار(Plantanus orintalis L.) فضای سبز شهر اصفهان
Iron chlorosis is an important disorder of plane trees (Plantanus orintalis L.) in green space of Isfahan city. Before using reclamation methods for correcting Fe chlorosis, it is necessary to find a suitable index for evaluating plant Fe status. Therefore, activity of glutathione peroxidase (GP) enzyme and concentration of carotenoids and chlorophyll a and b pigments, as physiological indices ...
متن کاملErgodic Theory on Galton-Watson Trees: Speed of Random Walk and Dimension of Harmonic Measure
We consider simple random walk on the family tree T of a nondegenerate supercritical Galton-Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T . Concretely, this implies that an exponentially small fraction of the nth level of T carries most of the harmonic measure. First order asymptotics for ...
متن کاملExtermal trees with respect to some versions of Zagreb indices via majorization
The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChemical Trees with Extreme Values of Zagreb Indices and Coindices
We give sharp upper bounds on the Zagreb indices and lower bounds on the Zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016